The unification problem for confluent right-ground term rewriting systems
نویسندگان
چکیده
منابع مشابه
Confluent Term Rewriting Systems with Membership Conditions
1. I n t r o d u c t i o n Many term rewriting systems and their modifications are considered in logic, automated theorem proving, and programming language [2,3,4,6,8,9]. A fundamental property of term rewriting systems is the confluence property. A few sufficient criteria for the confluence are well known [2,3,4,5,8,9]. However, if a term rewriting system is nonterminating and nonlinear, we kn...
متن کاملConfluence of Right Ground Term Rewriting Systems Is Decidable
Term rewriting systems provide a versatile model of computation. An important property which allows to abstract from potential nondeterminism of parallel execution of the modelled program is confluence. In this paper we prove that confluence of a fairly large class of systems, namely right ground term rewriting systems, is decidable. We introduce a labelling of variables with colours and constr...
متن کاملPersistence of Termination for Locally Confluent Overlay Term Rewriting Systems
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for locally confluent overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that co...
متن کاملConfluent Term Rewriting for Only-knowing Logics
Combining term rewriting and modal logics, this paper addresses confluence and termination of rewrite systems introduced for only-knowing logics. The rewrite systems contain a rule scheme that gives rise to an infinite number of critical pairs, hence we cannot check the joinability of every critical pair directly, in order to establish local confluence. We investigate conditions that are suffic...
متن کاملDerivation Trees of Ground Term Rewriting Systems
A notion of derivation tree is introduced for ground term rewriting systems and new proofs are given for some old results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00022-1